Local Cluster First Load Sharing Policy for Heterogeneous Clusters

نویسنده

  • Yi-Min Wang
چکیده

This paper studies the load sharing problem among heterogeneous cluster systems. The heterogeneous clusters we consider are time-sharing, and the computers in these clusters have different CPU powers and memory capacities. Load sharing means even workloads among all coordinated computers in the system. As some nodes suffer from high loading, it is necessary to migrate some jobs to the nodes with light loading. Recently, many load sharing policies, such as CPU-based and Memory-based policies, have been proposed for single-cluster system. However, they cannot be directly applied to larger-scale heterogeneous cluster systems. Without careful assignment, the cluster systems will waste time in moving migrated jobs to remote cluster, and thus reduce the performance of the cluster systems. In this paper we propose a simple but effective load sharing policy, local cluster first (LCF) policy, to improve the performance of various load sharing algorithms on heterogeneous cluster systems. The idea of LCF is that when some nodes suffer from heavy CPU (or/and memory) loading, the migrating procedure is carried on hierarchically. Since the heavy loading computer moves most of the migrated jobs to computers in the local cluster, the remote cluster migrations are reduced. We use a trace-driven simulator to simulate a heterogeneous cluster system. Compared with other load sharing policies, LCF reduces a lot of remote cluster migrations. As a result, LCF policy may improve the performance of load sharing on heterogeneous cluster systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Adaptive Space-Sharing Scheduling Policy for Non-dedicated Heterogeneous Cluster Systems

Adaptive space-sharing scheduling algorithms tend to improve the performance of clusters by allocating processors to jobs based on the current system load. The focus of existing adaptive algorithms is on dedicated homogeneous and heterogeneous clusters. However commodity clusters are naturally non-dedicated and tend to be heterogeneous over the time as cluster hardware is usually upgraded and n...

متن کامل

Scalable and Non-Intrusive Load Sharing in Owner-Based Distributed Systems

Figure 10: Intrusiveness on the LANs for the distributed algorithm with a heterogeneous load. 7 Conclusions We have shown that existing approaches to load sharing do not scale while supporting a rich set of policies and satisfying bounds on intrusiveness. Further, we have argued that in an owner-based distributed system , it is not sucient to choose a load sharing algorithm which typically indu...

متن کامل

A Modified Adaptive Space-Sharing Policy for Non-dedicated Heterogeneous Cluster Systems

Adaptive space-sharing algorithms are commonly used to realize the fullest strengths of dedicated homogeneous cluster computing systems since they produce better performance than fixed and variable-space sharing policies. However cluster of computers tend to be heterogeneous over the time because of both nature of incremental growth and diversity of technological change. Community-owned cluster...

متن کامل

Performance of Hierarchical Load Sharing in Heterogeneous Distributed Systems

− Performance of distributed systems can be improved by load sharing (i.e., distributing load from heavily loaded nodes to lightly loaded ones). Dynamic load sharing policies take system state into account in making job distribution decisions. The state information can be maintained in one of two basic ways: distributed or centralized. Two examples of distributed policies are the sender-initiat...

متن کامل

Modeling the Slowdown of Data-Parallel Applications in Homogeneous and Heterogeneous Clusters of Workstations

Data-parallel applications executing in multi-user clustered environments share resources with other applications. Since this sharing of resources dramatically affects the performance of individual applications, it is critical to estimate its effect, i.e., the application slowdown, in order to predict application behavior. In this paper, we develop a new approach for predicting the slowdown imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2007